An analysis of Gray versus binary encoding in genetic search
نویسندگان
چکیده
This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is little difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
منابع مشابه
The Influence Of Binary Representations Of Integers On The Performance Of Selectorecombinative Genetic Algorithms
When using representations for genetic algorithms (GAs) every optimization problem can be separated into a genotype-phenotype and a phenotype-fitness mapping. The genotypephenotype mapping is the used representation and the phenotype-fitness mapping is the problem that should be solved. This paper investigates how the use of different binary representations of integers influences the performanc...
متن کاملBinary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms
When using representations for genetic algorithms (GAs) every optimization problem can be separated into a genotype-phenotype and a phenotype-fitness mapping. The genotype-phenotype mapping is the used representation and the phenotype-fitness mapping is the problem that should be solved. This paper investigates how the use of different binary representations of integers influences the performan...
متن کاملLocality, Distance Distortion, and Binary Representations of Integers
This paper investigates how the performance of evolutionary search is influenced by the locality and distance distortion of the used representation. The locality of a representation describes how well neighboring phenotypes correspond to neighboring genotypes. The distance distortion measures whether the distances between individuals are preserved when mapping the phenotypes onto the genotypes....
متن کاملThe Study on an Improved Genetic Algorithm
By the analysis of the performance of binary encoding and real encoding and the characteristics of the optimization process, hybrid coding is proposed by combining binary encoding and real encoding. Hybrid coding synthesizes the advantage of both binary encoding and decimal encoding and maintains the accuracy of the algorithm. Accelerated operator based on line search is introduced to improve t...
متن کاملSearch, Binary Representations and Counting Optima
Choosing a good representation is a vital component of solving any search problem. However, choosing a good representation for a problem is as diicult as choosing a good search algorithm for a problem. Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. We elaborate on the No Free Lunch theorem by proving th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 156 شماره
صفحات -
تاریخ انتشار 2003